<h2>Problem: AiBjAmBn (PDA)</h2>

Please create a deterministic pushdown automaton <b>aibjambnPDA</b> that recognizes the following language:
<ul>
L = {a<sup>i</sup>b<sup>j</sup>a<sup>m</sup>b<sup>n</sup>: i,j,m,n&ge;1, i+m=j+n, i&le;j, n&le;m}
</ul>
Note: The condition n&le;m is redundant because it can be deduced from the others.
